Approximating Fixed Points of Nonexpansive Type Mappings via General Picard–Mann Algorithm
نویسندگان
چکیده
The aim of this paper is to approximate fixed points nonexpansive type mappings in Banach spaces when the set nonempty. We study general Picard–Mann (GPM) algorithm, obtaining weak and strong convergence theorems. provide an example illustrate behaviour GPM algorithm. compare algorithm with other existing (well known) algorithms numerically (under different parameters initial guesses).
منابع مشابه
Approximating Fixed Points of Nonexpansive Mappings
We consider a mapping S of the form S =α0I+α1T1+α2T2+···+αkTk, where αi ≥ 0, α0 > 0, α1 > 0 and ∑k i=0αi = 1. We show that the Picard iterates of S converge to a common fixed point of Ti (i = 1,2, . . . ,k) in a Banach space when Ti (i = 1,2, . . . ,k) are nonexpansive.
متن کاملApproximating Fixed Points of Nonexpansive Mappings
Let D be a subset of a normed space X and T : D → X be a nonexpansive mapping. In this paper we consider the following iteration method which generalizes Ishikawa iteration process: xn+1 = t (1) n T (t (2) n T (· · ·T (t (k) n Txn + (1− t (k) n )xn + u (k) n ) + · · · ) +(1− t n )xn + u (2) n ) + (1− t (1) n )xn + u (1) n , n = 1, 2, 3 . . . , where 0 ≤ t (i) n ≤ 1 for all n ≥ 1 and i = 1, . . ...
متن کاملConvergence of approximating fixed points sets for multivalued nonexpansive mappings
Let K be a closed convex subset of a Hilbert space H and T : K ⊸ K a nonexpansive multivalued map with a unique fixed point z such that {z} = T (z). It is shown that we can construct a sequence of approximating fixed points sets converging in the sense of Mosco to z.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2022
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation10090151